Heuristic solution methods for the selective disassembly sequencing problem under sequence-dependent costs

The first Waste Framework Directive issued by the European Union dates back to seventies but was drastically amended in last decade reduce environmental impacts of waste encouraging reuse, recycling and remanufacturing. Product recovery starts with disassembly which results high labor costs. Disassembly supports environmentally conscious choices like replacement defective parts extend life span products, removal suitable components for reuse extraction hazardous substances decontaminate materials reprocessing. Besides, selective also accommodates maintenance repairs. Optimizing cost is crucial make this process an economically viable option. Due change tools reorientation, costs are sequence-dependent. Therefore minimizing involves search adequate sequence tasks. Consequently, paper addresses sequencing problem sequential under sequence-dependent As optimal formulations fail handle real-world cases, we develop a randomized greedy algorithm (needing very few number parameters be set proving robust respect their value) matheuristic solve efficiently medium large-sized instances.